On the Complexity of Metric Dimension
نویسندگان
چکیده
The metric dimension of a graph G is the size of a smallest subset L ⊆ V (G) such that for any x, y ∈ V (G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric dimension of a graph is still very unclear. Essentially, we only know the problem to be NP-hard for general graphs, to be polynomialtime solvable on trees, and to have a logn-approximation algorithm for general graphs. In this paper, we show tight complexity boundaries for the Metric Dimension problem. We achieve this by giving two complementary results. First, we show that the Metric Dimension problem on bounded-degree planar graphs is NP-complete. Then, we give a polynomial-time algorithm for determining the metric dimension of outerplanar graphs.
منابع مشابه
On two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملThe Impact of Task Complexity along Single Task Dimension on EFL Iranian Learners' Written Production: Lexical complexity
Based on Robinson’s Cognition Hypothesis, this study explored the effects of task complexity on the lexical complexity of Iranian EFL students’ argumentative writing.This study was designed to explore the manipulation of cognitive task complexity along +/-single task dimension (a resource dispersing dimension in Robinson’s triadic framework) on Iranian EFL learners’ production in term of lexica...
متن کاملApplication of Task Complexity Along +/- single Task Dimension and its Effect on Fluency in Writing Performance of Iranian EFL Learners
In the present study, two different models of task complexity; namely, limited attentional capacity model and cognition hypothesis were examined. To this end, the manipulation of cognitive task complexity along +/- single task dimension on Iranian EFL learners’ production in terms of fluency was explored. Based on the results of the writing test of TOFEL (2004), 48 learners were selected as the...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملApplication of Task Complexity Along +/- single Task Dimension and its Effect on Fluency in Writing Performance of Iranian EFL Learners
In the present study, two different models of task complexity; namely, limited attentional capacity model and cognition hypothesis were examined. To this end, the manipulation of cognitive task complexity along +/- single task dimension on Iranian EFL learners’ production in terms of fluency was explored. Based on the results of the writing test of TOFEL (2004), 48 learners were selected as the...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کامل